from typing import List


class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        length1 = len(nums1)
        length2 = len(nums2)
        p1 = 0
        p2 = 0
        cnt = 0
        while cnt < ((length1 + length2) >> 1):
            if nums1[p1] < nums2[p2]:
                p1 += 1
            else:
                p2 += 1
            cnt += 1
        if ((length1 + length2) & 1):
            return min(nu)


if __name__ == '__main__':
    s = Solution()
    r = s.findMedianSortedArrays(nums1=[0, 0], nums2=[0, 0])
    print(r)
